Advances in Intelligent Data Analysis IX

Active learning in parallel universes.

Changing the Focus of the IDA Symposium.

CET A Tool for Creative Exploration of Graphs.

Changing the Focus of the IDA Symposium.



Distance aware tag clouds.

Learning in parallel universes.

Editorial.
calls &amp; calendarEDITORIAL
Pure spreading activation is pointless.

Crossover operators for multiobjective k%2Dsubset selection.

Open standards and cloud computing KDD%2D2009 panel report.

Multi%2DDimensional Scaling applied to Hierarchical Rule Systems.
This paper presents an approach for visualizing highdimensional fuzzy rules arranged in a hierarchy together with the training patterns they cover. A standard multi-dimensional scaling method is used to map the rule centers of the top hierarchy level to one coherent picture. Rules of the underlying levels are projected relatively to their parent level(s). In addition to the rules, all patterns are mapped onto the two-dimensional projection in relation to the positions of the corresponding rule centers. Visualization is further extended by showing hierarchical relationships between overlapping rules of different levels, which are generated by a hierarchical rule learner. This delivers interesting insights into the rule hierarchy and offers better explorative properties. Additionally, rules can be highlighted interactively emphasizing the subsequent rules at all underlying levels together with the patterns they cover. We demonstrate that this technique allows investigation of interesting rules at different levels of granularity, which makes this approach applicable even for a large number of rules. The proposed technique is illustrated and discussed based on a number of hierarchical rule model visualizations generated from well-known benchmark data sets.
Open standards and cloud computing KDD%2D2009 panel report.

The coming of age of artificial intelligence in medicine.

Active learning for object classification from exploration to exploitation.

KNIME %2D the Konstanz information miner version 2.0 and beyond.
The Konstanz Information Miner is a modular environment, which enables easy visual assembly and interactive execution of a data pipeline. It is designed as a teaching, research and collaboration platform, which enables simple integration of new algorithms and tools as well as data manipulation or visualization methods in the form of new modules or nodes. In this paper we describe some of the design aspects of the underlying architecture, briefly sketch how new nodes can be incorporated, and highlight some of the new features of version 2.0. editor is implemented as an Eclipse [9] plug-in. It is easy to extend through an open API and a data abstraction framework, which allows for new nodes to be quickly added in a well-defined way. In this paper – which is based on an earlier publication [1] concentrating on KNIME 1.3 – we describe the internals of KNIME in more detail with emphasis on the new features in KNIME 2.0. More information as well as downloads can be found at
Discovery Science
Introduction  Discovery has always attracted people and has been a major motiveforce  of progress in human history. It has long been discussed in the philosophyof  science but it is only after 1960&#039;s that the problem of discovery became properly addressed by new philosophy of science group  6)  . In the last two decades, there has also been a considerable progress, in the field of artificial intelligence, of a domain often considered the realm of genius - empirical discovery  5)  . Historically, discovery tends to be viewed as a difficult form of learning from observation although learning and discovery convey rather different meanings  4)  . The former suggests a gradual process, while the latter suggests a more rapid mental event, often involving some form of insight. Learning may lead to an unconscious change in knowledge, while one is always aware that a discovery has been made. The results of learning can be declarative or procedura
Supporting Creativity Towards Associative Discovery of New Insights.

Adaptive prototype%2Dbased fuzzy classification.

Corrigendum to Influence of fuzzy norms and other heuristics on %22Mixed fuzzy rule formation%22 %5BInt. J. Approx. Reasoning 35 %282004%29 195%2D202%5D.
Many fuzzy rule induction algorithms have been proposed during the past decade or so. Most of these algorithms tend to scale badly with large dimensions of the feature space and in addition have trouble dealing with different feature types or noisy data. In this paper, an algorithm is proposed that extracts a set of so called mixed fuzzy rules. These rules can be extracted from feature spaces with diverse types of attributes and handle the corresponding different types of constraints in parallel. The extracted rules depend on individual subsets of only few attributes, which is especially useful in high dimensional feature spaces. The algorithm along with results on several classification benchmarks is presented and how this method can be extended to handle outliers or noisy training instances is sketched briefly as well.
Parallel Universes and Local Patterns%2C 01.05. %2D 04.05.2007

Advances in Intelligent Data Analysis VII

KNIME The Konstanz Information Miner.
The Konstanz Information Miner is a modular environment which enables easy visual assembly and interactive execution of a data pipeline. It is designed as a teaching, research and collaboration platform, which enables easy integration of new algorithms, data manipulation or visualization methods as new modules or nodes. In this paper we describe some of the design aspects of the underlying architecture and briefly sketch how new nodes can be incorporated. OVERVIEW Large volumes of data are often generated during simulations and the need for modular data analysis environments has increased dramatically over the past years. In order to make use of the vast variety of data analysis
07181 Abstracts Collection %2D%2D Parallel Universes and Local Patterns .

07181 Introduction %2D%2D Parallel Universes and Local Patterns .

Learning in Parallel Universes.

Towards Visual Exploration of Topic Shifts.
Abstract — This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a multi-dimensional scaling algorithm, which places vectors representing terms occurring in certain years (periodfrequency-vectors) in a spatial, two-dimensional space. This kind of visualization enables the detection of terms occurring in documents, published in particular years, or terms spread over different years. The second method uses a graph based approach. Publishing dates of documents, as well as their terms are represented by the vertices of a graph. Terms related to a specific publishing year are connected to the vertex of the year via an edge. By usage of activation spreading techniques, terms frequently occurring in documents published in particular years can be discovered visually. We tested both approaches with 2431 abstracts of papers published in the IEEE Transactions on SMC-A, SMC-B, and SMC-C in the years 1996 to 2006. Our experiments indicate that a number of interesting terms can be nicely separated in clumps according to individual years or periods of time. In addition, one can visualize the emergence of specific terms over certain periods of time and how these and other terms fade away again later. I.
Fuzzy clustering in parallel universes.
We present an extension of the fuzzy c-Means algorithm, which operates simultaneously on different feature spaces—so-called parallel universes—and also incorporates noise detection. The method assigns membership values of patterns to different universes, which are then adopted throughout the training. This leads to better clustering results since patterns not contributing to clustering in a universe are (completely or partially) ignored. The method also uses an auxiliary universe to capture patterns that do not contribute to any of the clusters in the real universes and therefore are likely to represent noise. The outcome of the algorithm is clusters distributed over different parallel universes, each modeling a particular, potentially overlapping subset of the data and a set of patterns detected as noise. One potential target application of the proposed method is biological data analysis where different descriptors for molecules are available but none of them by itself shows global satisfactory prediction results.
Decentralized load balancing for highly irregular search problems.
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available. DLB approaches based on global statistics are known to provide optimal load balancing performance, while randomized techniques provide high scalability. The proposed method combines both advantages and adopts distributed job-pools and a randomized polling policy. The method has been successfully adopted in a parallel search algorithm for sugbraph mining. The work load distribution process of the parallel application is based on a dynamic partitioning of the search space and a peer-to-peer communication framework. The effectiveness of the DLB method has been evaluated on a molecular biology dataset. The distributed application with the novel DLB method has shown good scalability and close-to linear speedup in a distributed network of workstations. Moreover, fault tolerance and dynamic resource aggregation make it suitable for largescale, multi-domain, heterogeneous environments, such as computational Grids. 1.
Computational Life Sciences II

Context%2DAware Visual Exploration of Molecular Datab.

Decentralized Load Balancing for Highly Irregular Search Problems.
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available. DLB approaches based on global statistics are known to provide optimal load balancing performance, while randomized techniques provide high scalability. The proposed method combines both advantages and adopts distributed job-pools and a randomized polling policy. The method has been successfully adopted in a parallel search algorithm for sugbraph mining. The work load distribution process of the parallel application is based on a dynamic partitioning of the search space and a peer-to-peer communication framework. The effectiveness of the DLB method has been evaluated on a molecular biology dataset. The distributed application with the novel DLB method has shown good scalability and close-to linear speedup in a distributed network of workstations. Moreover, fault tolerance and dynamic resource aggregation make it suitable for largescale, multi-domain, heterogeneous environments, such as computational Grids. 1.
Adaptive Active Classification of Cell Assay Images.
Abstract. Classifying large datasets without any a-priori information poses a problem in many tasks. Especially in the field of bioinformatics, often huge unlabeled datasets have to be explored mostly manually by a biology expert. In this work we consider an application that is motivated by the development of high-throughput microscope screening cameras. These devices are able to produce hundreds of thousands of images per day. We propose a new adaptive active classification scheme which establishes ties between the two opposing concepts of unsupervised clustering of the underlying data and the supervised task of classification. Based on Fuzzy c-means clustering and Learning Vector Quantization, the scheme allows for an initial clustering of large datasets and subsequently for the adjustment of the classification based on a small number of carefully chosen examples. Motivated by the concept of active learning, the learner tries to query the most informative examples in the learning process and therefore keeps the costs for supervision at a low level. We compare our approach to Learning Vector Quantization with random selection and Support Vector Machines with Active Learning on several datasets. 1
Dynamic Load Balancing for the Distributed Mining of Molecular Structures.
Abstract — In molecular biology it is often desirable to find common properties in large numbers of drug candidates. One family of methods stems from the data mining community, where algorithms to find frequent graphs have received increasing attention over the past years. However, the computational complexity of the underlying problem and the large amount of data to be explored essentially render sequential algorithms useless. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. This problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely a dynamic partitioning of the search space, a distribution process based on a peer-to-peer communication framework, and a novel receiver-initiated load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening dataset, where we were able to show close-to linear speedup in a network of workstations. The proposed approach also allows for dynamic resource aggregation in a non-dedicated computational environment. These features make it suitable for large-scale, multi-domain, heterogeneous environments, such as computational Grids. Index Terms — Distributed computing, peer-to-peer computing, dynamic load balancing, subgraph mining, frequent patterns, biochemical databases, molecular compounds. I.
Computational Life Sciences
As software engineering educators, it is important for us to realize the increasing domainspecificity of software, and incorporate these changes in our design of teaching material. Bioinformatics software is an example of immensely complex and critical scientific software and this domain provides an excellent illustration of the role of computing in the life sciences. To study bioinformatics from a software engineering standpoint, we conducted an exploratory survey of bioinformatics developers. The survey had a range of questions about people, processes and products. As software engineering educators, we realized that the survey results had important implications for the education of bioinformatics professionals. We also investigated the current status of software engineering education in bioinformatics, by examining the curricula of more than fifty bioinformatics programs and the contents of over fifteen textbooks. We observed that there was no mention of the role and importance of software engineering practices essential for creating dependable software systems. Based on our findings and existing literature we present a set of recommendations for improving software engineering education in bioinformatics. 1.
Molecular Fragment Mining for Drug Discovery.
Abstract. The main task of drug discovery is to find novel bioactive molecules, i.e., chemical compounds that, for example, protect human cells against a virus. One way to support solving this task is to analyze a database of known and tested molecules in order to find structural properties of molecules that determine whether a molecule will be active or inactive, so that future chemical tests can be focused on the most promising candidates. A promising approach to this task was presented in [2]: an algorithm for finding molecular fragments that discriminate between active and inactive molecules. In this paper we review this approach as well as two extensions: a special treatment of rings and a method to find fragments with wildcards based on chemical expert knowledge. 1
Efficient Mining of Discriminative Molecular Fragments.

High Performance Subgraph Mining in Molecular Compounds.
Abstract. Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques particularly relevant. In this paper, we present a distributed approach to the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The problem is characterized by a highly irregular search tree, whereby no reliable workload prediction is available. We describe the three main aspects of the proposed distributed algorithm, namely a dynamic partitioning of the search space, a distribution process based on a peer-topeer communication framework, and a novel receiver-initiated, load balancing algorithm. The effectiveness of the distributed method has been evaluated on the well-known National Cancer Institute’s HIV-screening dataset, where the approach attains close-to linear speedup in a network of workstations. 1
Efficient Mining of Discriminative Molecular Fragments.

Exploring Hierarchical Rule Systems in Parallel Coordinates.
Abstract. Rule systems have failed to attract much interest in large data analysis problems because they tend to be too simplistic to be useful or consist of too many rules for human interpretation. We recently presented a method that constructs a hierarchical rule system, with only a small number of rules at each level of the hierarchy. Lower levels in this hierarchy focus on outliers or areas of the feature space where only weak evidence for a rule was found in the data. Rules further up, at higher levels of the hierarchy, describe increasingly general and strongly supported aspects of the data. In this paper we show how a connected set of parallel coordinate displays can be used to visually explore this hierarchy of rule systems and allows an intuitive mechanism to zoom in and out of the underlying model. 1
Interactive exploration of fuzzy clusters using Neighborgrams.

Hybrid fragment mining with MoFa and FSG.
Abstract – In the last few years a number of different subgraph mining algorithms have been proposed. They are often used for finding frequent fragments in molecular databases. All these algorithms behave quite well when used on small datasets of not more than a few thousand molecules. However, they all fail on larger amounts of data because they are either time consuming or have enormous memory requirements. In this paper we present a hybrid mining technique that overcomes the individual problems of the underlying algorithms and outperforms the individual methods impressively on large databases.
Advanced pruning strategies to speed up mining closed molecular fragments.
Abstract – In recent years several algorithms for mining frequent subgraphs in graph databases have been proposed, with a major application area being the discovery of frequent substructures of biomolecules. Unfortunately, most of these algorithms still struggle with fairly long execution times if larger substructures or molecular fragments are desired. In this paper we describe two advanced pruning strategies — equivalent sibling pruning and perfect extension pruning — that can be used to speed up the MoFa algorithm (introduced in [2]) in the search for closed molecular fragments, as we demonstrate with experiments on the NCI’s HIV database.
Influence of fuzzy norms and other heuristics on %22Mixed fuzzy rule formation%22.
The aggregate motion of a flock of birds, a herd of land animals, or a school of fish is a beautiful and familiar part of the natural world. But this type of complex motion is rarely seen in computer animation. This paper explores an approach based on simulation as an alternative to scripting the paths of each bird individually. The simulated flock is an elaboration of a particle system, with the simulated birds being the particles. The aggregate motion of the simulated flock is created by a distributed behavioral model much like that at work in a natural flock; the birds choose their own course. Each simulated bird is implemented as an independent actor that navigates according to its local perception of the dynamic environment, the laws of simulated physics that rule its motion, and a set of behaviors programmed into it by the &#034;animator.&#034; The aggregate motion of the simulated flock is the result of the dense interaction of the relatively simple behaviors of the individual simulated b...
Fuzzy information granules in time series data.

Guest Editorial %22Advances in intelligent data analysis%22.
All the More Reason for QR across the Curriculum The quantitative reasoning burden on US residents is huge and growing. In fact, no society has ever imposed such a heavy quantitative reasoning (QR) burden on its members; the consequences of this imposition are not at all clear and could result in the undoing of democratic processes. This undoing is much more likely because there has been no effective educational response to the increasing QR burden. An effective response will require a significant change in K-12 education plus all the collegiate disciplines working in concert. Some symptoms of the lack of a response follow along with some indications that make an effective response more challenging. QR Education Challenges in K-12 Rightly or wrongly, QR education in K-12 schools is the province of the mathematics curriculum, usually including data analysis, probability and statistics. Early-grades mathematics is very contextual, the correct mode for QR education. However, through middle school and into high school, mathematics
Large scale mining of molecular fragments with wildcards.
Abstract. The main task of drug discovery is to find novel bioactive molecules, i.e., chemical compounds that, for example, protect human cells against a virus. One way to support solving this task is to analyze a database of known and tested molecules with the aim to build a classifier that predicts whether a novel molecule will be active or inactive, so that future chemical tests can be focused on the most promising candidates. In [1] an algorithm for constructing such a classifier was proposed that uses molecular fragments to discriminate between active and inactive molecules. In this paper we present two extensions of this approach: A special treatment of rings and a method that finds fragments with wildcards based on chemical expert knowledge. 1
Advances in Intelligent Data Analysis V

Intelligent Data Analysis%2C An Introduction%2C 2nd editon

Large Scale Mining of Molecular Fragments with Wildcards.
Abstract. The main task of drug discovery is to find novel bioactive molecules, i.e., chemical compounds that, for example, protect human cells against a virus. One way to support solving this task is to analyze a database of known and tested molecules with the aim to build a classifier that predicts whether a novel molecule will be active or inactive, so that future chemical tests can be focused on the most promising candidates. In [1] an algorithm for constructing such a classifier was proposed that uses molecular fragments to discriminate between active and inactive molecules. In this paper we present two extensions of this approach: A special treatment of rings and a method that finds fragments with wildcards based on chemical expert knowledge. 1
Constructing Hierarchical Rule Systems.

Mixed fuzzy rule formation.
Many fuzzy rule induction algorithms have been proposed during the past decade or so. Most of these algorithms tend to scale badly with large dimensions of the feature space and in addition have trouble dealing with different feature types or noisy data. In this paper, an algorithm is proposed that extracts a set of so called mixed fuzzy rules. These rules can be extracted from feature spaces with diverse types of attributes and handle the corresponding different types of constraints in parallel. The extracted rules depend on individual subsets of only few attributes, which is especially useful in high dimensional feature spaces. The algorithm along with results on several classification benchmarks is presented and how this method can be extended to handle outliers or noisy training instances is sketched briefly as well.
Mining Molecular Fragments Finding Relevant Substructures of Molecules.
We present an algorithm to find fragments in a set of molecules that help to discriminate between different classes of, for instance, activity in a drug discovery context. Instead of carrying out a brute-force search, our method generates fragments by embedding them in all appropriate molecules in parallel and prunes the search tree based on a local order of the atoms and bonds, which results in substantially faster search by eliminating the need for frequent, computationally expensive reembeddings and by suppressing redundant search. We prove the usefulness of our algorithm by demonstrating the discovery of activity-related groups of chemical compounds in the well-known National Cancer Institute’s HIV-screening dataset. 1.
Neighborgram Clustering Interactive Exploration of Cluster Neighborhoods.

Input features%27 impact on fuzzy decision processes.

Advances in intelligent data analysis.
We propose a knowledge-intensive text analysis approach which deals with the continuous assimilation of new concepts into domain knowledge bases. Text understanding and knowledge acquisition proceed in tandem on the basis of terminological reasoning. Concept learning is considered an evidence-based choice problem the solution of which balances the &#034;quality&#034; of various clues from the linguistic structure of the texts and conceptual structures in the knowledge bases. 
Advances in Intelligent Data Analysis
We propose a knowledge-intensive text analysis approach which deals with the continuous assimilation of new concepts into domain knowledge bases. Text understanding and knowledge acquisition proceed in tandem on the basis of terminological reasoning. Concept learning is considered an evidence-based choice problem the solution of which balances the &#034;quality&#034; of various clues from the linguistic structure of the texts and conceptual structures in the knowledge bases. 
Learning and Rewriting in Fuzzy Rule Graphs.
. Dierent learning algorithms based on learning from examples  are described based on a set of graph rewrite rules. Starting from either a  very general or a very special rule set which is modeled as graph, two to three  basic rewrite rules are applied until a rule graph explaining all examples is  reached. The rewrite rules can also be used to model the corresponding  hypothesis space as they describe partial relations between dierent rule  set graphs. The possible paths, algorithms can take through the hypothesis  space can be described as application sequences. This schema is applied to  general learning algorithms as well as to fuzzy rule learning algorithms.  1 Introduction  Building models from data has started to raise increasing attention, especially in areas where a large amount of data is gathered automatically and manual analysis is not feasible anymore. Also applications where data is recorded online without a possibility for continuous analysis are demanding for automati...
Discriminative Power of Input Features in a Fuzzy Model.
. In many modern data analysis scenarios the first and most  urgent task consists of reducing the redundancy in high dimensional input  spaces. A method is presented that quantifies the discriminative  power of the input features in a fuzzy model. A possibilistic information  measure of the model is defined on the basis of the available fuzzy rules  and the resulting possibilistic information gain, associated with the use  of a given input dimension, characterizes the input feature&#039;s discriminative  power. Due to the low computational expenses derived from the  use of a fuzzy model, the proposed possibilistic information gain generates  a simple and efficient algorithm for the reduction of the input  dimensionality, even for high dimensional cases. As real-world example,  the most informative electrocardiographic measures are detected for an  arrhythmia classification problem.  1 Introduction  In the last years it has become more and more common to collect and store large amounts of da...
Constructing fuzzy graphs from examples.
Methods to build function approximators from example data have gained considerable interest in the past. Especially methodologies that build models that allow an interpretation have attracted attention. Most existing algorithms, however, are either complicated to use or infeasible for high-dimensional problems. This article presents an efficient and easy to use algorithm to construct fuzzy graphs from example data. The resulting fuzzy graphs are based on locally independent fuzzy rules that operate solely on selected, important attributes. This enables the application of these fuzzy graphs also to problems in high dimensional spaces. Using illustrative examples and a real world data set it is demonstrated how the resulting fuzzy graphs offer quick insights into the structure of the example data, that is, the underlying model.  Michael Berthold is with ICSI and the University of California at Berkeley, Computer Science Division, Department of EECS,  Berkeley, CA 94720, USA. E-mail: bert...
Intelligent Data Analysis Reasoning About Data.
We propose a knowledge-intensive text analysis approach which deals with the continuous assimilation of new concepts into domain knowledge bases. Text understanding and knowledge acquisition proceed in tandem on the basis of terminological reasoning. Concept learning is considered an evidence-based choice problem the solution of which balances the &#034;quality&#034; of various clues from the linguistic structure of the texts and conceptual structures in the knowledge bases. 
Editorial Reasoning About Data.

Missing Values and Learning of Fuzzy Rules.
this paper a technique is proposed to tolerate missing values based on a system of fuzzy rules for classification. The presented method is mathematically solid but nevertheless easy and efficient to implement. Three possible applications of this methodology are outlined: the classification of patterns with an incomplete feature vector, the completion of the input vector when a certain class is desired, and the training or automatic construction of a fuzzy rule set based on incomplete training data. In contrast to a static replacement of the missing values, here the evolving model is used to predict the most possible values for the missing attributes. Benchmark datasets are used to demonstrate the capability of the presented approach in a fuzzy learning environment.
Constructive training of probabilistic neural networks.
This paper presents an easy to use, constructive training algorithm for Probabilistic Neural Networks, a special type of Radial Basis Function Networks. In contrast to other algorithms, predefinition of the network topology is not required. The proposed algorithm introduces new hidden units whenever necessary and adjusts the shape of already existing units individually to minimize the risk of misclassification. This leads to smaller networks compared to classical PNNs and therefore enables the use of large datasets. Using eight classification benchmarks from the StatLog project, the new algorithm is compared to other state of the art classification methods. It is demonstrated that the proposed algorithm generates Probabilistic Neural Networks that achieve a comparable classification performance on these datasets. Only two rather uncritical parameters are required to be adjusted manually and there is no danger of overtraining --- the algorithm clearly indicates the end of training. In a...
Clustering on the Net Applying an autoassociative neural network to computer%2Dmediated discussions.

Advances in Intelligent Data Analysis
We propose a knowledge-intensive text analysis approach which deals with the continuous assimilation of new concepts into domain knowledge bases. Text understanding and knowledge acquisition proceed in tandem on the basis of terminological reasoning. Concept learning is considered an evidence-based choice problem the solution of which balances the &#034;quality&#034; of various clues from the linguistic structure of the texts and conceptual structures in the knowledge bases. 
Simulation Data Analysis Using Fuzzy Graphs.

Clustering on the Net Applying an autoassociative neural network to computer%2Dmediated discussions.

Fuzzy Graph Based Metamodeling.
Several approaches to robust design have been proposed in the past. Only few acknowledged the paradigm shift from performance based design to design for cost. The incorporation of economics in the design process, however, makes a probabilistic approach to design necessary, due to the inherent ambiguity of assumptions and requirements as well as the operating environment of future aircraft. The approach previously proposed by the authors, linking Response Surface Methodology with Monte Carlo Simulations, has revealed itself to be cumbersome and at times impractical for multiconstraint, multi-objective problems. In addition, prediction accuracy problems were observed for certain scenarios that could not easily be resolved. Hence, this paper proposes an alternate approach to probabilistic design, which is based on a Fast Probability Integration technique. The paper critically reviews the combined Response Surface Equation/ Monte Carlo Simulation methodology and compares it against the Adv...
Analysis of Simulation Models with Fuzzy Graph Based Metamodeling.

Ein Trainingsverfahren f%FCr Radial Basis Function Netzwerke mit dynamischer Selektion der Zentren und Adaption der Radii.

Boosting the Performance of RBF Networks with Dynamic Decay Adjustment.
Radial Basis Function (RBF) Networks, also known as networks of locally--tuned processing units (see [6]) are well known for their ease of use. Most algorithms used to train these types of networks, however, require a fixed architecture, in which the number of units in the hidden layer must be determined before training starts. The RCE training algorithm, introduced by Reilly, Cooper and Elbaum (see [8]), and its probabilistic extension, the P--RCE algorithm, take advantage of a growing structure in which hidden units are only introduced when necessary. The nature of these algorithms allows training to reach stability much faster than is the case for gradient--descent based methods. Unfortunately P--RCE networks do not adjust the standard deviation of their prototypes individually, using only one global value for this parameter. This paper introduces the Dynamic Decay Adjustment (DDA) algorithm which utilizes the constructive nature of the P--RCE algorithm together with independent ada...
